Views of Fibonacci dynamics

The Binet formula gives a natural way for Fibonacci numbers to be viewed as a function of a complex variable. We experimentally study the complex dynamics of the Fibonacci numbers viewed in that manner. Attracting and repelling fixed points are related to the filled Julia set and to regions of escape time images with fascinating behavior. Introduction The Fibonacci numbers are traditionally described as a sequence n F defined by 0 0 = F , 1 1 = F , and 2 1 − − + = n n n F F F . The sequence begins 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144,.... The Fibonacci sequence has many remarkable properties, ranging from routine to startling [1-4]. Moreover, the numbers arise in nature, for example, as the number of spirals of pinecone petals. They may also be used to construct mathematical quasicrystals [5]. One of the beautiful formulas of Fibonacci numbers is the Binet formula. Binet described a version of the formula in 1843 [6-7]. Its beauty arises from the fact that the formula gives a closed form solution to a recursive definition, and from the symmetry of the formula itself. The Binet formula my be derived from the theory of difference equations, it can be derived by diagonalizing a suitable matrix, or it can be proven by induction [1-3]. The Fibonacci recursion has characteristic equation 0 1 2 = − − x x which has roots 1.618 2 5 1 ≈ + = τ and -0.618 2 5 1 ≈ − = τ where τ is the golden ratio and τ is the conjugate of τ . Choosing constants to satisfy the initial conditions 0 0 = F and 1 1 = F gives the Binet formula: 5 n n n F τ − τ = . To obtain the Fibonacci numbers as a function of a complex variable, instead of viewing the index n in the Binet formula as an integer, we view it as a complex variable z. Thus we define the following complex Fibonacci function. 5 ) ( z z z F τ − τ = The number τ is negative and τ appears as the base of an exponential in the Binet formula. Thus, complex numbers will result for fractional real arguments. Nonetheless, the Binet form gives a natural generalization of the Fibonacci sequence. It satisfies the initial conditions 0 ) 0 ( = F and 1 ) 1 ( = F . It also satisfies the recursion ) 2 ( ) 1 ( ) ( − + − = z F z F z F and it is defined for all complex values z. Thus, we can ask questions about the complex dynamics of this function. What are its fixed points? Are they attracting or repelling? What happens upon iteration of the